Airline crew scheduling: models, algorithms, and data sets
نویسندگان
چکیده
منابع مشابه
4 Airline Crew Scheduling
Crew scheduling can be defined as the problem of assigning a group of workers (a crew) to a set of tasks. The crews are typically interchangeable , although in some cases different crews possess different characteristics that affect which subsets of tasks they can complete. Crew scheduling problems appear in a number of transportation contexts. Examples include bus and rail transit, truck and r...
متن کاملAirline Crew Scheduling Under Uncertainty
A crew scheduling algorithms widely used in practice assume no disruptions. Because disruptions often occur, the actual cost of the resulting crew schedules is often greater. We consider algorithms for finding crew schedules that perform well in practice. The deterministic crew scheduling model is an approximation of crew scheduling under uncertainty with the assumption that all pairings will o...
متن کاملGeneration Approach to Airline Crew Scheduling
The airline crew scheduling problem deals with the construction of crew rotations in order to cover the flights of a given schedule at minimum cost. The problem involves complex rules for the legality and costs of individual pairings and base constraints for the availability of crews at home bases. A typical instance considers a planning horizon of one month and several thousand flights. We pro...
متن کاملAirline Crew Scheduling: State-of-the-Art
The airline industry is faced with some of the largest scheduling problems of any industry. The crew scheduling problem involves the optimal allocation of crews to flights. Over the last two decades the magnitude and complexity of crew scheduling problems have grown enormously and airlines are relying more on automated mathematical procedures as a practical necessity. In this paper we survey di...
متن کاملAirline Crew Scheduling: a Group Theoretic Approach
The problem of airline crew scheduling is studied, the different problems composing it are formulated and solution techniques are offered. Special emphasis is given to the set covering problem appearing in the rotation selection phase. An approach is presented, based on the group theoretic method, which allows the fast solution of problems with large sizes. Thesis Supervisor: Robert W. Simpson ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURO Journal on Transportation and Logistics
سال: 2015
ISSN: 2192-4376,2192-4384
DOI: 10.1007/s13676-015-0080-x